Extremely Accurate and Efficient Algorithms for European-Style Asian Options with Range Bounds
نویسندگان
چکیده
Asian options can be priced on the unrecombining binomial tree. Unfortunately, without approximation, the running time is exponential. This paper presents efficient and extremely accurate approximation algorithms for European-style Asian options on the binomial tree. For a European-style Asian option with strike price X on an n-period binomial tree, our algorithm runs in O(kn2) time with a guaranteed error bound of O(X √ n/k) for any positive integer k. Parameter k can be adjusted for any desired trade-off between time and accuracy. This basic algorithm is then modified to give increasingly tighter upper and lower bounds (or range bounds) that bracket the desired option value while maintaining the same computational efficiency. As the upper and lower bounds are essentially numerically identical in practice, the proposed algorithms can be said to price European-style Asian options exactly without combinatorial explosion. Our results also imply for the first time in the literature that the popular Hull-White algorithms are upper-bound algorithms. Extensive computer experiments are conducted to confirm the extreme accuracy of the algorithms and their competitiveness in comparison with alternative schemes.
منابع مشابه
Accurate and efficient lattice algorithms for American-style Asian options with range bounds
متن کامل
A convergent quadratic-time lattice algorithm for pricing European-style Asian options
Asian options are strongly path-dependent derivatives. Although efficient numerical methods and approximate closedform formulas are available, most lack convergence guarantees. Asian options can also be priced on the lattice. All efficient lattice algorithms keep only a polynomial number of states and use interpolation to compensate for the less than full representation of the states. Let the t...
متن کاملBounds for the price of discrete arithmetic Asian options
In this paper the pricing of European-style discrete arithmetic Asian options with fixed and floating strike is studied by deriving analytical lower and upper bounds. In our approach we use a general technique for deriving upper (and lower) bounds for stop-loss premiums of sums of dependent random variables, as explained in Kaas, Dhaene and Goovaerts (2000), and additionally, the ideas of Roger...
متن کاملEfficient Pricing of European-Style Asian Options under Exponential Lévy Processes Based on Fourier Cosine Expansions
We propose an efficient pricing method for arithmetic and geometric Asian options under exponential Lévy processes based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European-style and American-style Asian options and for discretely and continuously monitored versions. In the present paper we focus on the European-style Asian options. The...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 11-11 Efficient Pricing of Asian Options under Lévy Processes based on Fourier Cosine Expansions Part I: European-Style Products
We propose an efficient pricing method for arithmetic, and geometric, Asian options under Lévy processes, based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European–style and American–style Asian options, and for discretely and continuously monitored versions. In the present paper we focus on European–style Asian options; American-style ...
متن کامل